Unique Decomposition in Classifiable Theories

نویسندگان

  • Bradd Hart
  • Ehud Hrushovski
  • Michael C. Laskowski
چکیده

By a classifiable theory we shall mean a theory which is superstable, without the dimensional order property, which has prime models over pairs. In order to define what we mean by unique decomposition, we remind the reader of several definitions and results. We adopt the usual conventions of stability theory and work inside a large saturated model of a fixed classifiable theory T ; for instance, if we write M ⊆ N for models of T , M and N we are thinking of these models as elementary submodels of this fixed saturated models; so, in particular, M is an elementary submodel of N . Although the results will not depend on it, we will assume that T is countable to ease notation. We do adopt one piece of notation which is not completely standard: if T is classifiable, M0 ⊆ Mi for i = 1, 2 are models of T and M1 is independent fromM2 over M0 then we writeM1⊕M0M2 for the prime model overM1∪M2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The isomorphism problem for computable Abelian p-groups of bounded length

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out a sequence of examples. We follow recent work by...

متن کامل

The isomorphism problem for classes of computable fields

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out several examples. One motivation is to see wheth...

متن کامل

The Isomorphism Problem for Familiar Classes of Computable Structures I

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (Dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out several examples. One motivation is to see wheth...

متن کامل

Finitely Generated Nilpotent Group C*-algebras Have Finite Nuclear Dimension

We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra A generated by an irreducible representation of such a group has decomposition rank at most 3. If, in addition, A satisfies the universal coefficient theorem, another string of deep results shows it is classifiable by its Ellio...

متن کامل

On the Classification of Simple Unital C*-algebras with Finite Decomposition Rank, Ii

Let A be a simple separable unital C*-algebra satisfying the UCT, and assume that A has finite decomposition rank. Let Q denote the UHF algebra with K0(Q) = Q. Then A⊗Q can be tracially approximated by unital Elliott-Thomsen algebras, and therefore A ⊗ Z is an ASH algebra (hence classifiable), where Z is the Jiang-Su algebra.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 67  شماره 

صفحات  -

تاریخ انتشار 2002